Global Code Selection of Directed Acyclic Graphs
نویسندگان
چکیده
We describe a novel technique for code selection based on data ow graphs which arise naturally in the domain of digital signal processing Code selection is the optimized mapping of abstract opera tions to partial machine instructions The presented method performs an important task within the retargetable microcode generator CBC which was designed to cope with the requirements arising in the context of cus tom digital signal processor DSP programming The algorithm exploits a graph representation in which control ow is modeled by scopes
منابع مشابه
Global Code Selection for Directed Acyclic Graphs*
We describe a novel technique for code selection based on data-flow graphs, which arise naturally in the domain of digital signal processing. Code selection is the optimized mapping of abstract operations to partial machine instructions. The presented method performs an important task within the retargetable microcode generator CBC, which was designed to cope with the requirements arising in th...
متن کاملNear-Optimal Instruction Selection on DAGs
Instruction selection is a key component of code generation. High quality instruction selection is of particular importance in the embedded space where complex instruction sets are common and code size is a prime concern. Although instruction selection on tree expressions is a well understood and easily solved problem, instruction selection on directed acyclic graphs is NP-complete. In this pap...
متن کاملGraphical representation of independence structures
In this thesis we describe subclasses of a class of graphs with three types of edges, called loopless mixed graphs (LMGs). The class of LMGs contains almost all known classes of graphs used in the literature of graphical Markov models. We focus in particular on the subclass of ribbonless graphs (RGs), which as special cases include undirected graphs, bidirected graphs, and directed acyclic grap...
متن کاملDagma: Mining Directed Acyclic Graphs
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multior single-rooted, and induced fragments. With a new canonical form that is based on the nodes' topological levels, our miner is faster and uses less storage than general purpose gSpan (Yan, X. and Han, J., 2002). Moreover, it can base support resp. frequency either on the number of embeddings o...
متن کاملGray Code Results for Acyclic Orientations
Given a graph G, the acyclic orientation graph of G, denoted AO(G), is the graph whose vertices are the acyclic orientations of G, and two acyclic orientations are joined by an edge in AO(G) iff they differ by the reversal of a single edge. A hamilton cycle in AO(G) gives a Gray code listing of the acyclic orientations of G. We prove that for certain graphs G, AO(G) is hamiltonian, and give exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994